A covering system with least modulus 25
نویسنده
چکیده
A collection of congruences with distinct moduli, each greater than 1, such that each integer satisfies at least one of the congruences, is said to be a covering system. A famous conjecture of Erdös from 1950 states that the least modulus of a covering system can be arbitrarily large. This conjecture remains open and, in its full strength, appears at present to be unattackable. Most of the effort in this direction has been aimed at explicitly constructing covering systems with large least modulus. Improving upon previous results of Churchhouse, Krukenberg, Choi, and Morikawa, we construct a covering system with least modulus 25. The construction involves a large-scale computer search, in conjunction with two general results that considerably reduce the complexity of the search.
منابع مشابه
On the Infinitude of Covering Systems with Least Modulus Equal to 2
A finite set of residue classes ai (mod ni) with 1 < n1 < n2 < · · · < ns is called a covering system of congruences if every integer satisfies at least one of the congruences x ≡ai (mod ni). An example is the set {0 (mod 2), 1 (mod 3), 3 (mod 4), 5 (mod 6), 9 (mod 12)}. A covering system all of whose moduli are odd called an odd covering system is a famous unsolved conjecture of Erdös and Self...
متن کاملParameters Analysis of the Covering Soil of Tunnels Constructed In Liquefiable Soils
Earthquake and its catastrophic failures has been one of the disturbance worry of Civil Engineers. In geotechnical science, liquefaction is one of the most important phenomenons induced by earthquake. A change in pore water pressure follows a change in effective stress, and in a critical state in which pore water pressure equals the total stress in soil particles, soil strength is suddenly lost...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملOn the Range of a Covering Function
Let {as(mod ns)}s=1 (k > 1) be a finite system of residue classes with the moduli n1, . . . , nk distinct. By means of algebraic integers we show that the range of the covering function w(x) = |{1 6 s 6 k : x ≡ as (mod ns)}| is not contained in any residue class with modulus greater than one. In particular, the values of w(x) cannot have the same parity.
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 78 شماره
صفحات -
تاریخ انتشار 2009